Refinement Type Checking via Assertion Checking
نویسندگان
چکیده
منابع مشابه
Model Checking Linearizability via Refinement
Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires checking that 1) all executions of concurrent operations be serializable, and 2) the serialized executions be correct with respect to the sequential semantics. This paper describes a new method to automatically check linearizab...
متن کاملChecking Behavioural Subtypes via Refinement
Behavioural subtyping is concerned with the question of whether one class is behaviourally consistent with another class. The word “behaviour” in this context usually refers to the semantics of methods, typically given by preand postconditions. In this paper, we will use this term in a more specific way, referring to the dynamic behaviour of objects in time. Behaviour descriptions of classes gi...
متن کاملAssertion Checking Unified
We revisit the connection between equality assertion checking in programs and unification that was recently described in [8]. Using a general formalization of this connection, we establish interesting connections between the complexity of assertion checking in programs and unification theory of the underlying program expressions. In particular, we show that assertion checking is: (a) PTIME for ...
متن کاملRefinement via Consistency Checking in MDA
Refinement is a key practice in the Model-Driven Architecture initiative of the Object Modelling Group. However, the practice is loosely defined, overloaded, and open to misinterpretation. In this paper, we outline ongoing work on providing a precise definition for refinement via consistency checking, not only in the context of MDA, but more generally for model-driven development in a variety o...
متن کاملAssertion Checking Unified (Full Version)
We revisit the connection between equality assertion checking in programs and unification that was recently described in [8]. Using a general formalization of this connection, we establish interesting connections between the complexity of assertion checking in programs and unification theory of the underlying program expressions. In particular, we show that assertion checking is: (a) PTIME for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2015
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.23.827